LOCAL CONVEXITY AND Ln SETS1
نویسنده
چکیده
We will prove that a closed connected set S in ET whose points of local nonconvexity can be decomposed into a finite number of convex parts also possesses a simple type of polygonal connectedness. Furthermore, if S has a finite number of points of local nonconvexity, we obtain another result. In order to describe this situation easily we use the notation of Ln set used by Horn and Valentine [l ] in 1949. For other results related to Ln sets, see A. Bruckner and J. Bruckner [l] and Valentine [l]. The following notations and definitions will enable us to express the results more readily. Notations. The interior, boundary and closure of a set S in Euclidean r-space Er are denoted by int S, bd 5 and cl 5 respectively. If xES, yES, then xy denotes the closed line segment joining x and y. The symbols U, C\ and ~ denote set union, set intersection and set difference respectively. The symbol 0 is used to denote the empty set. The convex hull of a set SEE, is indicated by conv S. Definition 1. A set 5 is called an Ln set if each pair of points in S can be joined by a polygonal arc of S containing at most n segments. Definition 2. A point x E S is a point of local convexity of 5 if there exists a neighborhood N of x such that Nf~\S is convex; otherwise, x is called a point of local nonconvexity of S. Definition 3. A set S is starshaped relative to a point p if for every x E S it is true that pxES. The following two theorems together with Theorem 3 stated later contain the main results of this paper. The symbols n and r always denote non-negative integers.
منابع مشابه
On convexity in complex networks
Lovro Šubelj University of Ljubljana, Faculty of Computer and Information Science Ljubljana, Slovenia [email protected] Tilen Marc Institute of Mathematics, Physics and Mechanics Ljubljana, Slovenia [email protected] Metric graph theory is a study of geometric properties of graphs based on a notion of the shortest path between the nodes defined as the path through the smallest number ...
متن کاملSome New Inequalities Between Important Means and Applications to Ky Fan - type Inequalities
In this paper, mainly using the convexity of the function a x −b x cx−dx and convexity or concavity of the function ln a x −b x cx−dx on the real line, where a > b ≥ c > d > 0 are fixed real numbers, we obtain some important relations between various important means of these numbers. Also, we apply the obtained results to Ky Fan type inequalities and get some new refinements. 2000 Mathematics S...
متن کاملSome New Inequalities Between Important Means and Applications to Ky Fan Types Inequalities
In this paper, mainly using the convexity of the function a −b cx−dx and convexity or concavity of the function ln a −b cx−dx on the real line, where a > b ≥ c > d > 0 are fixed real numbers, we obtain some important relations between various important means of these numbers. Also, we apply the obtained results to Ky Fan type inequalities and get some new refinements. 2000 Mathematics Subject C...
متن کاملOn the Iteration Complexity of Oblivious First-Order Optimization Algorithms
We consider a broad class of first-order optimization algorithms which are oblivious, in the sense that their step sizes are scheduled regardless of the function under consideration, except for limited side-information such as smoothness or strong convexity parameters. With the knowledge of these two parameters, we show that any such algorithm attains an iteration complexity lower bound of Ω( √...
متن کاملRisk and parameter convergence of logistic regression
The logistic loss is strictly convex and does not attain its infimum; consequently the solutions of logistic regression are in general off at infinity. This work provides a convergence analysis of gradient descent applied to logistic regression under no assumptions on the problem instance. Firstly, the risk is shown to converge at a rate O(ln(t)/t). Secondly, the parameter convergence is charac...
متن کامل